#include "gtkintl.h"
#include "gtkalias.h"
-#define GTK_LIST_STORE_IS_SORTED(list) (GTK_LIST_STORE (list)->sort_column_id != GTK_TREE_SORTABLE_UNSORTED_SORT_COLUMN_ID)
+#define GTK_LIST_STORE_IS_SORTED(list) (((GtkListStore*)(list))->sort_column_id != GTK_TREE_SORTABLE_UNSORTED_SORT_COLUMN_ID)
#define VALID_ITER(iter, list_store) ((iter)!= NULL && (iter)->user_data != NULL && list_store->stamp == (iter)->stamp && !_gtk_sequence_ptr_is_end ((iter)->user_data) && _gtk_sequence_ptr_get_sequence ((iter)->user_data) == list_store->seq)
static void gtk_list_store_init (GtkListStore *list_store);
{
GType *new_columns;
- g_return_if_fail (GTK_IS_LIST_STORE (list_store));
- g_return_if_fail (n_columns > 0);
-
if (list_store->n_columns == n_columns)
return;
gint column,
GType type)
{
- g_return_if_fail (GTK_IS_LIST_STORE (list_store));
- g_return_if_fail (column >=0 && column < list_store->n_columns);
-
if (!_gtk_tree_data_list_check_type (type))
{
g_warning ("%s: Invalid type %s passed to gtk_list_store_set_column_type\n", G_STRLOC, g_type_name (type));
static GtkTreeModelFlags
gtk_list_store_get_flags (GtkTreeModel *tree_model)
{
- g_return_val_if_fail (GTK_IS_LIST_STORE (tree_model), 0);
-
return GTK_TREE_MODEL_ITERS_PERSIST | GTK_TREE_MODEL_LIST_ONLY;
}
{
GtkListStore *list_store = (GtkListStore *) tree_model;
- g_return_val_if_fail (GTK_IS_LIST_STORE (tree_model), 0);
-
list_store->columns_dirty = TRUE;
return list_store->n_columns;
{
GtkListStore *list_store = (GtkListStore *) tree_model;
- g_return_val_if_fail (GTK_IS_LIST_STORE (tree_model), G_TYPE_INVALID);
- g_return_val_if_fail (index < GTK_LIST_STORE (tree_model)->n_columns &&
- index >= 0, G_TYPE_INVALID);
+ g_return_val_if_fail (index < GTK_LIST_STORE (tree_model)->n_columns,
+ G_TYPE_INVALID);
list_store->columns_dirty = TRUE;
GtkSequence *seq;
gint i;
- g_return_val_if_fail (GTK_IS_LIST_STORE (tree_model), FALSE);
- g_return_val_if_fail (gtk_tree_path_get_depth (path) > 0, FALSE);
-
list_store->columns_dirty = TRUE;
seq = list_store->seq;
{
GtkTreePath *path;
- g_return_val_if_fail (GTK_IS_LIST_STORE (tree_model), NULL);
g_return_val_if_fail (iter->stamp == GTK_LIST_STORE (tree_model)->stamp, NULL);
if (_gtk_sequence_ptr_is_end (iter->user_data))
gint column,
GValue *value)
{
+ GtkListStore *list_store = (GtkListStore *) tree_model;
GtkTreeDataList *list;
gint tmp_column = column;
- g_return_if_fail (GTK_IS_LIST_STORE (tree_model));
- g_return_if_fail (column < GTK_LIST_STORE (tree_model)->n_columns);
- g_return_if_fail (GTK_LIST_STORE (tree_model)->stamp == iter->stamp);
- g_return_if_fail (VALID_ITER (iter, GTK_LIST_STORE(tree_model)));
+ g_return_if_fail (column < list_store->n_columns);
+ g_return_if_fail (VALID_ITER (iter, list_store));
list = _gtk_sequence_ptr_get_data (iter->user_data);
list = list->next;
if (list == NULL)
- g_value_init (value, GTK_LIST_STORE (tree_model)->column_headers[column]);
+ g_value_init (value, list_store->column_headers[column]);
else
_gtk_tree_data_list_node_to_value (list,
- GTK_LIST_STORE (tree_model)->column_headers[column],
+ list_store->column_headers[column],
value);
}
gtk_list_store_iter_next (GtkTreeModel *tree_model,
GtkTreeIter *iter)
{
- g_return_val_if_fail (GTK_IS_LIST_STORE (tree_model), FALSE);
g_return_val_if_fail (GTK_LIST_STORE (tree_model)->stamp == iter->stamp, FALSE);
iter->user_data = _gtk_sequence_ptr_next (iter->user_data);
GtkTreeIter *iter,
GtkTreeIter *parent)
{
- GtkListStore *list_store;
+ GtkListStore *list_store = (GtkListStore *) tree_model;
/* this is a list, nodes have no children */
if (parent)
return FALSE;
- list_store = GTK_LIST_STORE (tree_model);
-
if (_gtk_sequence_get_length (list_store->seq) > 0)
{
iter->stamp = list_store->stamp;
gtk_list_store_iter_n_children (GtkTreeModel *tree_model,
GtkTreeIter *iter)
{
- GtkListStore *store;
-
- g_return_val_if_fail (GTK_IS_LIST_STORE (tree_model), -1);
+ GtkListStore *list_store = (GtkListStore *) tree_model;
- store = GTK_LIST_STORE (tree_model);
-
if (iter == NULL)
- return _gtk_sequence_get_length (store->seq);
+ return _gtk_sequence_get_length (list_store->seq);
+
+ g_return_val_if_fail (list_store->stamp == iter->stamp, -1);
- g_return_val_if_fail (store->stamp == iter->stamp, -1);
return 0;
}
GtkTreeIter *parent,
gint n)
{
+ GtkListStore *list_store = (GtkListStore *) tree_model;
GtkSequencePtr child;
- GtkListStore *store;
-
- g_return_val_if_fail (GTK_IS_LIST_STORE (tree_model), FALSE);
- store = GTK_LIST_STORE (tree_model);
-
if (parent)
return FALSE;
- child = _gtk_sequence_get_ptr_at_pos (store->seq, n);
+ child = _gtk_sequence_get_ptr_at_pos (list_store->seq, n);
if (_gtk_sequence_ptr_is_end (child))
return FALSE;
- iter->stamp = store->stamp;
+ iter->stamp = list_store->stamp;
iter->user_data = child;
+
return TRUE;
}
gboolean converted = FALSE;
gboolean retval = FALSE;
- g_return_val_if_fail (GTK_IS_LIST_STORE (list_store), FALSE);
- g_return_val_if_fail (VALID_ITER (iter, list_store), FALSE);
- g_return_val_if_fail (column >= 0 && column < list_store->n_columns, FALSE);
- g_return_val_if_fail (G_IS_VALUE (value), FALSE);
-
if (! g_type_is_a (G_VALUE_TYPE (value), list_store->column_headers[column]))
{
if (! (g_value_type_compatible (G_VALUE_TYPE (value), list_store->column_headers[column]) &&
{
va_list var_args;
- g_return_if_fail (GTK_IS_LIST_STORE (list_store));
- g_return_if_fail (iter != NULL);
- g_return_if_fail (iter->stamp == list_store->stamp);
-
va_start (var_args, iter);
gtk_list_store_set_valist (list_store, iter, var_args);
va_end (var_args);
GtkTreePath *path)
{
GtkTreeIter iter;
- g_return_val_if_fail (GTK_IS_LIST_STORE (drag_source), FALSE);
if (gtk_tree_model_get_iter (GTK_TREE_MODEL (drag_source),
&iter,
GtkTreePath *path,
GtkSelectionData *selection_data)
{
- g_return_val_if_fail (GTK_IS_LIST_STORE (drag_source), FALSE);
-
/* Note that we don't need to handle the GTK_TREE_MODEL_ROW
* target, because the default handler does it for us, but
* we do anyway for the convenience of someone maybe overriding the
GtkTreePath *src_path = NULL;
gboolean retval = FALSE;
- g_return_val_if_fail (GTK_IS_LIST_STORE (drag_dest), FALSE);
-
tree_model = GTK_TREE_MODEL (drag_dest);
list_store = GTK_LIST_STORE (drag_dest);
GtkTreePath *src_path = NULL;
gboolean retval = FALSE;
- g_return_val_if_fail (GTK_IS_LIST_STORE (drag_dest), FALSE);
-
/* don't accept drops if the list has been sorted */
if (GTK_LIST_STORE_IS_SORTED (drag_dest))
return FALSE;
{
GtkListStore *list_store = (GtkListStore *) sortable;
- g_return_val_if_fail (GTK_IS_LIST_STORE (sortable), FALSE);
-
if (sort_column_id)
* sort_column_id = list_store->sort_column_id;
if (order)
{
GtkListStore *list_store = (GtkListStore *) sortable;
- g_return_if_fail (GTK_IS_LIST_STORE (sortable));
-
if ((list_store->sort_column_id == sort_column_id) &&
(list_store->order == order))
return;
GtkDestroyNotify destroy)
{
GtkListStore *list_store = (GtkListStore *) sortable;
- GtkTreeDataSortHeader *header = NULL;
- GList *list;
-
- g_return_if_fail (GTK_IS_LIST_STORE (sortable));
- g_return_if_fail (func != NULL);
list_store->sort_list = _gtk_tree_data_list_set_header (list_store->sort_list,
sort_column_id,
{
GtkListStore *list_store = (GtkListStore *) sortable;
- g_return_if_fail (GTK_IS_LIST_STORE (sortable));
-
if (list_store->default_sort_destroy)
{
GtkDestroyNotify d = list_store->default_sort_destroy;
{
GtkListStore *list_store = (GtkListStore *) sortable;
- g_return_val_if_fail (GTK_IS_LIST_STORE (sortable), FALSE);
-
return (list_store->default_sort_func != NULL);
}
#include "gtkalias.h"
#define G_NODE(node) ((GNode *)node)
-#define GTK_TREE_STORE_IS_SORTED(tree) (GTK_TREE_STORE (tree)->sort_column_id != GTK_TREE_SORTABLE_UNSORTED_SORT_COLUMN_ID)
-#define VALID_ITER(iter, tree_store) (iter!= NULL && iter->user_data != NULL && tree_store->stamp == iter->stamp)
+#define GTK_TREE_STORE_IS_SORTED(tree) (((GtkTreeStore*)(tree))->sort_column_id != GTK_TREE_SORTABLE_UNSORTED_SORT_COLUMN_ID)
+#define VALID_ITER(iter, tree_store) ((iter)!= NULL && (iter)->user_data != NULL && ((GtkTreeStore*)(tree_store))->stamp == (iter)->stamp)
static void gtk_tree_store_init (GtkTreeStore *tree_store);
static void gtk_tree_store_class_init (GtkTreeStoreClass *tree_store_class);
{
GType *new_columns;
- g_return_if_fail (GTK_IS_TREE_STORE (tree_store));
-
if (tree_store->n_columns == n_columns)
return;
gint column,
GType type)
{
- g_return_if_fail (GTK_IS_TREE_STORE (tree_store));
- g_return_if_fail (column >=0 && column < tree_store->n_columns);
if (!_gtk_tree_data_list_check_type (type))
{
g_warning ("%s: Invalid type %s passed to gtk_tree_store_new_with_types\n", G_STRLOC, g_type_name (type));
static GtkTreeModelFlags
gtk_tree_store_get_flags (GtkTreeModel *tree_model)
{
- g_return_val_if_fail (GTK_IS_TREE_STORE (tree_model), 0);
-
return GTK_TREE_MODEL_ITERS_PERSIST;
}
{
GtkTreeStore *tree_store = (GtkTreeStore *) tree_model;
- g_return_val_if_fail (GTK_IS_TREE_STORE (tree_model), 0);
-
tree_store->columns_dirty = TRUE;
return tree_store->n_columns;
{
GtkTreeStore *tree_store = (GtkTreeStore *) tree_model;
- g_return_val_if_fail (GTK_IS_TREE_STORE (tree_model), G_TYPE_INVALID);
- g_return_val_if_fail (index < GTK_TREE_STORE (tree_model)->n_columns &&
- index >= 0, G_TYPE_INVALID);
+ g_return_val_if_fail (index < tree_store->n_columns, G_TYPE_INVALID);
tree_store->columns_dirty = TRUE;
gint *indices;
gint depth, i;
- g_return_val_if_fail (GTK_IS_TREE_STORE (tree_store), FALSE);
-
tree_store->columns_dirty = TRUE;
indices = gtk_tree_path_get_indices (path);
gtk_tree_store_get_path (GtkTreeModel *tree_model,
GtkTreeIter *iter)
{
+ GtkTreeStore *tree_store = (GtkTreeStore *) tree_model;
GtkTreePath *retval;
GNode *tmp_node;
gint i = 0;
- g_return_val_if_fail (GTK_IS_TREE_STORE (tree_model), NULL);
- g_return_val_if_fail (iter != NULL, NULL);
g_return_val_if_fail (iter->user_data != NULL, NULL);
- g_return_val_if_fail (iter->stamp == GTK_TREE_STORE (tree_model)->stamp, NULL);
+ g_return_val_if_fail (iter->stamp == tree_store->stamp, NULL);
- validate_tree ((GtkTreeStore*)tree_model);
+ validate_tree (tree_store);
if (G_NODE (iter->user_data)->parent == NULL &&
- G_NODE (iter->user_data) == GTK_TREE_STORE (tree_model)->root)
+ G_NODE (iter->user_data) == tree_store->root)
return gtk_tree_path_new ();
g_assert (G_NODE (iter->user_data)->parent != NULL);
- if (G_NODE (iter->user_data)->parent == G_NODE (GTK_TREE_STORE (tree_model)->root))
+ if (G_NODE (iter->user_data)->parent == G_NODE (tree_store->root))
{
retval = gtk_tree_path_new ();
- tmp_node = G_NODE (GTK_TREE_STORE (tree_model)->root)->children;
+ tmp_node = G_NODE (tree_store->root)->children;
}
else
{
gint column,
GValue *value)
{
+ GtkTreeStore *tree_store = (GtkTreeStore *) tree_model;
GtkTreeDataList *list;
gint tmp_column = column;
- g_return_if_fail (GTK_IS_TREE_STORE (tree_model));
- g_return_if_fail (iter != NULL);
- g_return_if_fail (iter->stamp == GTK_TREE_STORE (tree_model)->stamp);
- g_return_if_fail (column < GTK_TREE_STORE (tree_model)->n_columns);
+ g_return_if_fail (column < tree_store->n_columns);
+ g_return_if_fail (VALID_ITER (iter, tree_store));
list = G_NODE (iter->user_data)->data;
if (list)
{
_gtk_tree_data_list_node_to_value (list,
- GTK_TREE_STORE (tree_model)->column_headers[column],
+ tree_store->column_headers[column],
value);
}
else
{
/* We want to return an initialized but empty (default) value */
- g_value_init (value, GTK_TREE_STORE (tree_model)->column_headers[column]);
+ g_value_init (value, tree_store->column_headers[column]);
}
}
gtk_tree_store_iter_next (GtkTreeModel *tree_model,
GtkTreeIter *iter)
{
- g_return_val_if_fail (iter != NULL, FALSE);
g_return_val_if_fail (iter->user_data != NULL, FALSE);
g_return_val_if_fail (iter->stamp == GTK_TREE_STORE (tree_model)->stamp, FALSE);
GtkTreeIter *iter,
GtkTreeIter *parent)
{
+ GtkTreeStore *tree_store = (GtkTreeStore *) tree_model;
GNode *children;
- g_return_val_if_fail (parent == NULL || parent->user_data != NULL, FALSE);
- g_return_val_if_fail (parent == NULL || parent->stamp == GTK_TREE_STORE (tree_model)->stamp, FALSE);
+ if (parent)
+ g_return_val_if_fail (VALID_ITER (parent, tree_store), FALSE);
if (parent)
children = G_NODE (parent->user_data)->children;
else
- children = G_NODE (GTK_TREE_STORE (tree_model)->root)->children;
+ children = G_NODE (tree_store->root)->children;
if (children)
{
- iter->stamp = GTK_TREE_STORE (tree_model)->stamp;
+ iter->stamp = tree_store->stamp;
iter->user_data = children;
return TRUE;
}
gtk_tree_store_iter_has_child (GtkTreeModel *tree_model,
GtkTreeIter *iter)
{
- g_return_val_if_fail (GTK_IS_TREE_STORE (tree_model), FALSE);
- g_return_val_if_fail (iter->stamp == GTK_TREE_STORE (tree_model)->stamp, FALSE);
g_return_val_if_fail (iter->user_data != NULL, FALSE);
+ g_return_val_if_fail (VALID_ITER (iter, tree_model), FALSE);
return G_NODE (iter->user_data)->children != NULL;
}
GNode *node;
gint i = 0;
- g_return_val_if_fail (GTK_IS_TREE_STORE (tree_model), 0);
g_return_val_if_fail (iter == NULL || iter->user_data != NULL, 0);
if (iter == NULL)
GtkTreeIter *parent,
gint n)
{
+ GtkTreeStore *tree_store = (GtkTreeStore *) tree_model;
GNode *parent_node;
GNode *child;
- g_return_val_if_fail (GTK_IS_TREE_STORE (tree_model), FALSE);
g_return_val_if_fail (parent == NULL || parent->user_data != NULL, FALSE);
if (parent == NULL)
- parent_node = GTK_TREE_STORE (tree_model)->root;
+ parent_node = tree_store->root;
else
parent_node = parent->user_data;
if (child)
{
iter->user_data = child;
- iter->stamp = GTK_TREE_STORE (tree_model)->stamp;
+ iter->stamp = tree_store->stamp;
return TRUE;
}
else
GtkTreeIter *iter,
GtkTreeIter *child)
{
+ GtkTreeStore *tree_store = (GtkTreeStore *) tree_model;
GNode *parent;
g_return_val_if_fail (iter != NULL, FALSE);
- g_return_val_if_fail (child != NULL, FALSE);
- g_return_val_if_fail (child->user_data != NULL, FALSE);
- g_return_val_if_fail (child->stamp == GTK_TREE_STORE (tree_model)->stamp, FALSE);
+ g_return_val_if_fail (VALID_ITER (child, tree_store), FALSE);
parent = G_NODE (child->user_data)->parent;
g_assert (parent != NULL);
- if (parent != GTK_TREE_STORE (tree_model)->root)
+ if (parent != tree_store->root)
{
iter->user_data = parent;
- iter->stamp = GTK_TREE_STORE (tree_model)->stamp;
+ iter->stamp = tree_store->stamp;
return TRUE;
}
else
gboolean converted = FALSE;
gboolean retval = FALSE;
- g_return_val_if_fail (GTK_IS_TREE_STORE (tree_store), FALSE);
- g_return_val_if_fail (VALID_ITER (iter, tree_store), FALSE);
- g_return_val_if_fail (column >= 0 && column < tree_store->n_columns, FALSE);
- g_return_val_if_fail (G_IS_VALUE (value), FALSE);
-
if (! g_type_is_a (G_VALUE_TYPE (value), tree_store->column_headers[column]))
{
if (! (g_value_type_compatible (G_VALUE_TYPE (value), tree_store->column_headers[column]) &&
{
va_list var_args;
- g_return_if_fail (GTK_IS_TREE_STORE (tree_store));
- g_return_if_fail (VALID_ITER (iter, tree_store));
-
va_start (var_args, iter);
gtk_tree_store_set_valist (tree_store, iter, var_args);
va_end (var_args);
gtk_tree_path_free (path);
- validate_tree ((GtkTreeStore*)tree_store);
+ validate_tree (tree_store);
}
/**
gtk_tree_path_free (path);
- validate_tree ((GtkTreeStore*)tree_store);
+ validate_tree (tree_store);
}
/**
gtk_tree_store_insert_after (tree_store, iter, parent, NULL);
}
- validate_tree ((GtkTreeStore*)tree_store);
+ validate_tree (tree_store);
}
/**
g_return_if_fail (GTK_IS_TREE_STORE (tree_store));
g_return_if_fail (iter != NULL);
-
if (parent != NULL)
g_return_if_fail (VALID_ITER (parent, tree_store));
gtk_tree_store_insert_before (tree_store, iter, parent, NULL);
}
- validate_tree ((GtkTreeStore*)tree_store);
+ validate_tree (tree_store);
}
/**
/* simple ripoff from g_node_traverse_post_order */
static gboolean
-gtk_tree_store_clear_traverse (GNode *node,
+gtk_tree_store_clear_traverse (GNode *node,
GtkTreeStore *store)
{
GtkTreeIter iter;
{
GtkTreeIter iter;
- g_return_val_if_fail (GTK_IS_TREE_STORE (drag_source), FALSE);
-
if (gtk_tree_model_get_iter (GTK_TREE_MODEL (drag_source),
&iter,
path))
GtkTreePath *path,
GtkSelectionData *selection_data)
{
- g_return_val_if_fail (GTK_IS_TREE_STORE (drag_source), FALSE);
-
/* Note that we don't need to handle the GTK_TREE_MODEL_ROW
* target, because the default handler does it for us, but
* we do anyway for the convenience of someone maybe overriding the
GtkTreePath *src_path = NULL;
gboolean retval = FALSE;
- g_return_val_if_fail (GTK_IS_TREE_STORE (drag_dest), FALSE);
-
tree_model = GTK_TREE_MODEL (drag_dest);
tree_store = GTK_TREE_STORE (drag_dest);
GtkTreePath *tmp = NULL;
gboolean retval = FALSE;
- g_return_val_if_fail (GTK_IS_TREE_STORE (drag_dest), FALSE);
-
/* don't accept drops if the tree has been sorted */
if (GTK_TREE_STORE_IS_SORTED (drag_dest))
return FALSE;
{
GtkTreeStore *tree_store = (GtkTreeStore *) sortable;
- g_return_val_if_fail (GTK_IS_TREE_STORE (sortable), FALSE);
-
if (sort_column_id)
* sort_column_id = tree_store->sort_column_id;
if (order)
{
GtkTreeStore *tree_store = (GtkTreeStore *) sortable;
- g_return_if_fail (GTK_IS_TREE_STORE (sortable));
-
if ((tree_store->sort_column_id == sort_column_id) &&
(tree_store->order == order))
{
GtkTreeStore *tree_store = (GtkTreeStore *) sortable;
- g_return_if_fail (GTK_IS_TREE_STORE (sortable));
- g_return_if_fail (func != NULL);
-
tree_store->sort_list = _gtk_tree_data_list_set_header (tree_store->sort_list,
sort_column_id,
func, data, destroy);
{
GtkTreeStore *tree_store = (GtkTreeStore *) sortable;
- g_return_if_fail (GTK_IS_TREE_STORE (sortable));
-
if (tree_store->default_sort_destroy)
{
GtkDestroyNotify d = tree_store->default_sort_destroy;
{
GtkTreeStore *tree_store = (GtkTreeStore *) sortable;
- g_return_val_if_fail (GTK_IS_TREE_STORE (sortable), FALSE);
-
return (tree_store->default_sort_func != NULL);
}